Minimum centroid neighborhood for minimum zone sphericity
نویسندگان
چکیده
منابع مشابه
Optimization of Minimum Quantity Liquid Parameters in Turning for the Minimization of Cutting Zone Temperature
The use of cutting fluid in manufacturing industries has now become more problematic due to environmental pollution and health related problems of employees. Also the minimization of cutting fluid leads to the saving of lubricant cost and cleaning time of machine, tool and work-piece. The concept of minimum Quantity Lubrication (MQL) has come in to practice since a decade ago in order to overco...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملNeighborhood Search for the Bounded Diameter Minimum Spaning Tree
Many optimization problems including the network design problem of finding the bounded diameter minimum spanning tree are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic algorithms that can find solution close to the optimal one within a reasonable amount of time. Neighborhood search algorithms are a wide class of algorithms where at...
متن کاملVariable Neighborhood Search for the Minimum Interference Frequency Assignment Problem
The frequency assignment is an important task in the design of radio network. Let us concider a GSM network N composed of a set of nc cells: C= {C1, C2 . . . Ci, . . . Cnc}. Each cell required a number of frequencies which is defined by the number of transceivers TRX or traffic demand Di= {1, 2 . . . , x}An interval of operational frequencies: [Fmax − Fmin]. Further, consider a matrix: MCo[nc][...
متن کاملA multi-exchange neighborhood for minimum makespan machine scheduling problems
We propose new local search algorithms for minimum makespan machine scheduling problems, which perform multiple exchanges of jobs among machines. Inspired by the work of Thompson and Orlin (1989) on cyclic transfer neighborhood structures, we model multiple exchanges of jobs as special disjoint cycles and paths in a suitably defined improvement graph, by extending definitions and properties int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Precision Engineering
سال: 2014
ISSN: 0141-6359
DOI: 10.1016/j.precisioneng.2013.11.004